package org.example.SolutionNew006;

public class BinarySearch005 {
    public static void main(String[] args) {
        BinarySearch005 binarySearch005 = new BinarySearch005();
        int[] nums=new int[]{3,4,5,1,2};
        System.out.println(binarySearch005.findMin(nums));
    }

    public int findMin(int[] nums) {
        int left=0,right=nums.length-1;
        while(left<right){
            int mid=left+(right-left)/2;
            if(nums[mid]<nums[right]){
                right=mid;
            }else{
                left=mid+1;
            }
        }
        return nums[left];
    }
}
